Solving the Generalized Poisson Equation in Proper and Directed Interval Arithmetic
نویسندگان
چکیده
منابع مشابه
Interval Linear Programming with generalized interval arithmetic
Generally, vagueness is modelled by a fuzzy approach and randomness by a stochastic approach. But in some cases, a decision maker may prefer using interval numbers as coefficients of an inexact relationship. In this paper, we define a linear programming problem involving interval numbers as an extension of the classical linear programming problem to an inexact environment. By using a new simple...
متن کاملOn directed interval arithmetic and its applications
We discuss two closely related interval arithmetic systems: i) the system of directed (generalized) intervals studied by E. Kaucher, and ii) the system of normal intervals together with the outer and inner interval operations. A relation between the two systems becomes feasible due to introduction of special notations and a so-called normal form of directed intervals. As an application, it has ...
متن کاملGoal-Directed Equation Solving
Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like E&LOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms....
متن کاملSolving discrete minimax problems using interval arithmetic
We present an interval algorithm for solving discrete minimax problems where the constituent minimax functions are continuously differentiable functions of one real variable. Our approach is based on smoothing the max-type function by exploiting the Jaynes’s maximum entropy [Phys. Rev., 106:620–630, 1957]. The algorithm works within the branchand-bound framework and uses first order information...
متن کاملSolving Decidability Problems with Interval Arithmetic
An affine iterated function system (IFS, [4]) over the reals is given by a set of contractive affine transformations on a complete metric space R for some positive natural number k. Thus an interesting problem is to decide, whether a given matrix M describes a contraction mapping, i.e. whether there exists some s < 1 such that |Mz| ≤ s|z| for each z ∈ R, where | · | denotes the Euclidean norm. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Methods in Science and Technology
سال: 2016
ISSN: 1505-0602,2353-9453
DOI: 10.12921/cmst.2016.0000048